منابع مشابه
Minimum path bases and relevant paths
Given an undirected graph G(V, E) and a vertex subset U ⊆ V the U space is the vector space over GF(2) spanned by the paths with end-points in U and the cycles in G(V, E). We extend Vismara’s algorithm to the computation of the union of all minimum length bases of the U -space. While the size distribution of subgraphs is the same in all minimum length bases, the number of cycles and paths may d...
متن کاملA Note On Minimum Path Bases
Given an undirected graph G(V,E) and a vertex subset U ⊆ V the U -space is the vector space over GF(2) spanned by the paths with end-points in U and the cycles in G(V,E). We extend Vismara’s algorithm to the computation of the union of all minimum length bases of the U -space.
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملMinimum Degree and Dominating Paths
A dominating path in a graph is a path P such that every vertex outside P has a neighbor on P. A result of Broersma from 1988 implies that if G is an n-vertex k-connected graph and δ(G) > n−k k+2 − 1, then G contains a dominating path. We prove the following results. The lengths of dominating paths include all values from the shortest up to at least min{n − 1,2δ(G)}. For δ(G) > an, where a is a...
متن کاملMinimum-link paths revisited
A path or a polygonal domain is C-oriented if the orientations of its edges belong to a set of C given orientations; this is a generalization of the notable rectilinear case (C = 2). We study exact and approximation algorithms for minimum-link C-oriented paths and paths with unrestricted orientations, both in C-oriented and in general domains. We obtain the following results: • An optimal algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2005
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20080